-
1 iterative-descent method
Англо-русский словарь промышленной и научной лексики > iterative-descent method
-
2 итерационный метод спуска
Русско-английский физический словарь > итерационный метод спуска
-
3 итерационный метод спуска
Makarov: iterative-descent methodУниверсальный русско-английский словарь > итерационный метод спуска
См. также в других словарях:
Descent direction — In optimization, a descent direction is a vector that, in the sense below, moves us closer towards a local minimum of our objective function . Suppose we are computing by an iterative method, such as line search. We define a descent direction at… … Wikipedia
Conjugate gradient method — A comparison of the convergence of gradient descent with optimal step size (in green) and conjugate vector (in red) for minimizing a quadratic function associated with a given linear system. Conjugate gradient, assuming exact arithmetic,… … Wikipedia
Newton's method in optimization — A comparison of gradient descent (green) and Newton s method (red) for minimizing a function (with small step sizes). Newton s method uses curvature information to take a more direct route. In mathematics, Newton s method is an iterative method… … Wikipedia
Newton's method — In numerical analysis, Newton s method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real valued function. The… … Wikipedia
Least absolute deviations — (LAD), also known as Least Absolute Errors (LAE), Least Absolute Value (LAV), or the L1 norm problem, is a mathematical optimization technique similar to the popular least squares technique that attempts to find a function which closely… … Wikipedia
Stress majorization — is an optimization strategy used in multidimensional scaling (MDS) where, for a set of n , m dimensional data items, a configuration X of n points in r( … Wikipedia
CMA-ES — stands for Covariance Matrix Adaptation Evolution Strategy. Evolution strategies (ES) are stochastic, derivative free methods for numerical optimization of non linear or non convex continuous optimization problems. They belong to the class of… … Wikipedia
Consensus clustering — Clustering is the assignment of objects into groups (called clusters) so that objects from the same cluster are more similar to each other than objects from different clusters. Often similarity is assessed according to a distance measure.… … Wikipedia
Sid Meier's Alpha Centauri — SMAC redirects here. For other uses, see SMAC (disambiguation). Sid Meier s Alpha Centauri Sid Meier s Alien Crossfire … Wikipedia
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia